Linking rings structures and semisymmetric graphs: Combinatorial constructions
نویسندگان
چکیده
منابع مشابه
Semisymmetric graphs from polytopes
Every finite, self-dual, regular (or chiral) 4-polytope of type {3, q, 3} has a trivalent 3-transitive (or 2-transitive) medial layer graph. Here, by dropping self-duality, we obtain a construction for semisymmetric trivalent graphs (which are edgebut not vertex-transitive). In particular, the Gray graph arises as the medial layer graph of a certain universal locally toroidal regular 4-polytope.
متن کاملGeometric and Combinatorial Structures on Graphs
Acknowledgments First of all I want to thank my advisor, Stefan Felsner. In lectures and many discussions I learned a lot from him not only about graph theory and combinatorics. He was also willing to share the large and little tricks and insights that make (scientific) working so much easier. During lunches and many coffee breaks I also learned a lot from Stefan about life, the universe, and e...
متن کاملAffine Primitive Groups and Semisymmetric Graphs
In this paper, we investigate semisymmetric graphs which arise from affine primitive permutation groups. We give a characterization of such graphs, and then construct an infinite family of semisymmetric graphs which contains the Gray graph as the third smallest member. Then, as a consequence, we obtain a factorization of the complete bipartite graph Kpspt ,psp into connected semisymmetric graph...
متن کاملCubic Semisymmetric Graphs of Order 2p 3 Semisymmetric Graphs of Order 2p 3
A regular graph is called semisymmetric if it is edge-transitive but not vertex-transitive. It is proved that the Gray graph is the only cubic semisymmetric graph of order 2p3, where p 3 is a prime.
متن کاملNew Constructions for Perfect Hash Families andRelated Structures using Combinatorial
In this paper, we consider explicit constructions of perfect hash families using combi-natorial methods. We provide several direct constructions from combinatorial structures related to orthogonal arrays. We also simplify and generalize a recursive construction due to Atici, Magliversas, Stinson and Wei 3]. Using similar methods, we also obtain eecient constructions for separating hash families...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2017
ISSN: 1855-3974,1855-3966
DOI: 10.26493/1855-3974.1007.3ec